Generalized Complexity and Classical-Quantum Transition
نویسندگان
چکیده
منابع مشابه
Generalized Complexity and Classical-Quantum Transition
We investigate the classical limit of the dynamics of a semiclassical system that represents the interaction between matter and a given field. On using as a quantifier the qComplexity, we find that it describes appropriately the quantum-classical transition, detecting the most salient details of the changeover. Additionally the q-Complexity results a better quantifier of the problem than the q-...
متن کاملNon-Markovian Complexity in the Quantum-to-Classical Transition
The quantum-to-classical transition is due to environment-induced decoherence, and it depicts how classical dynamics emerges from quantum systems. Previously, the quantum-to-classical transition has mainly been described with memory-less (Markovian) quantum processes. Here we study the complexity of the quantum-to-classical transition through general non-Markovian memory processes. That is, the...
متن کاملClassical complexity and quantum entanglement
Generalizing a decision problem for bipartite perfect matching, Edmonds (J. Res. Natl. Bur. Standards 718(4) (1967) 242) introduced the problem (now known as the Edmonds Problem) of deciding if a given linear subspace ofM(N) contains a non-singular matrix, whereM(N) stands for the linear space of complexN ×N matrices. This problem led to many fundamental developments in matroid theory, etc. Cla...
متن کاملUncountable classical and quantum complexity classes
Polynomial–time constant–space quantum Turing machines (QTMs) and logarithmic–space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (Say and Yakaryılmaz 2014, arXiv:1411.7647). In this paper, we investigate more restricted cases for both models to recognize uncountably many languages with bounded error. We show that double logarithmic space is enough...
متن کاملInterpolating Between Quantum and Classical Complexity Classes
We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: ⋆ Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In particular, we show that while (⋆) is doable in quantum randomized polynomial time when m=2 (and no classical randomized polynomial time algorithm is known), (⋆) i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2009
ISSN: 1099-4300
DOI: 10.3390/e11010111